Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
نویسندگان
چکیده
منابع مشابه
Indexing Straight-Line Programs∗
Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...
متن کاملDeciding Probabilistic Program Equivalence in NetKAT
We tackle the problem of deciding whether a pair of probabilistic programs are equivalent in the context of Probabilistic NetKAT, a formal language for reasoning about the behavior of packet-switched networks. We show that the problem is decidable for the history-free fragment of the language. The main challenge lies in reasoning about iteration, which we address by a reduction to nite-state ab...
متن کاملFaster Sparse Interpolation of Straight-Line Programs
We give a new probabilistic algorithm for interpolating a “sparse” polynomial f given by a straight-line program. Our algorithm constructs an approximation f of f , such that f − f probably has at most half the number of terms of f , then recurses on the difference f−f. Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more ef...
متن کاملStraight-line Programs in Polynomial Equation Solving
Solving symbolically polynomial equation systems when intermediate and final polynomials are represented in the usual dense encoding turns out to be very inefficient: the sizes of the systems one can deal with do not respond to realistic needs. Evaluation representations appeared in this frame a decade ago as a new possibility to treat new families of problems. We present a survey of the most r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1983
ISSN: 0004-5411,1557-735X
DOI: 10.1145/322358.322373